Two-Edge Disjoint Survivable Network Design Problem with Relays: A Hybrid Genetic Algorithm and Lagrangian Heuristic Approach

This paper presents a network design problem with relays considering the twoedge network connectivity. The problem arises in telecommunication and logistic networks where a constraint is imposed on the distance that a commodity can travel on a route without being processed by a relay, and the survivability of the network is critical in case of a component failure. The network design problem involves selecting two edgedisjoint paths between source and destination node pairs and determining the location of relays to minimize the network design cost. The formulated problem is solved by a hybrid approach of a genetic algorithm (GA) and a Lagrangian heuristic such that the GA searches for two-edge disjoint paths for each commodity, and the Lagrangian heuristic is used to determine relays on these paths. The performance of the proposed hybrid approach is compared to the previous approaches from the literature with promising results.